Asymptotically Efficient Solutions to the Classification Problem
نویسندگان
چکیده
منابع مشابه
Efficient solutions to the braid isotopy problem
We describe the most efficient solutions to the word problem of Artin’s braid group known so far, i.e., in other words, the most efficient solutions to the braid isotopy problem, including the Dynnikov method, which could be especially suitable for cryptographical applications. Most results appear in literature; however, some results about the greedy normal form and the symmetric normal form an...
متن کاملSome Efficient Solutions to Yao's Millionaire Problem
We present three simple and efficient protocol constructions to solve Yao’s Millionaire Problem when the parties involved are non-colluding and semi-honest. The first construction uses a partially homomorphic Encryption Scheme and is a 4-round scheme using 2 encryptions, 2 homomorphic circuit evaluations (subtraction and XOR) and a single decryption. The second construction uses an untrusted th...
متن کاملAsymptotically Efficient Smoothing in the Wicksell Problem under Squared Losses
Abstract—In the Wicksell problem, it is required to reconstruct a distribution function of radii of balls located in an opaque medium from measurements of radii of circles obtained by intersecting the medium with a certain plane. This problem is intimately bound up with estimating a fractional derivative of order 1/2 for a distribution function concentrated on the positive semi-axis. In this pa...
متن کاملFair and Efficient Solutions to the Santa Fe Bar Problem
This paper asks the question: can adaptive, but not necessarily rational, agents learn Nash equilibrium behavior in the Santa Fe Bar Problem? To answer this question, three learning algorithms are simulated: fictitious play, no-regret learning, and Q-learning. Conditions under which these algorithms can converge to equilibrium behavior are isolated. But it is noted that the pure strategy Nash e...
متن کامل.e an Asymptotically Efficient Solution to the Bandwidth Problem of Kernel Density Esti~~tion
A data-driven method of choosing the bandwidth, h, of a kernel density estimator is proposed. It is seen that this mean& of selecting h is asymptotically equivalent to taking the h that minimizes a certain weighted version of the mean integrated square error. Thus, for a given kernel function, the bandwidth can be chosen optimally without making precise smoothness assumptions on the underlying ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 1978
ISSN: 0090-5364
DOI: 10.1214/aos/1176344197